Assessing the Difficulty of Chess Tactical Problems

نویسندگان

  • Dayana Hristova
  • Matej Guid
  • Ivan Bratko
چکیده

We investigate experts’ ability to assess the difficulty of a mental task for a human. The final aim is to find formalized measures of difficulty that could be used in automated assessment of the difficulty of a task. In experiments with tactical chess problems, the experts’ estimations of difficulty are compared to the statistic-based difficulty ratings on the Chess Tempo website. In an eye tracking experiment, the subjects’ solutions to chess problems and the moves that they considered are analyzed. Performance data (time and accuracy) are used as indicators of subjectively perceived difficulty. We also aim to identify the attributes of tactical positions that affect the difficulty of the problem. Understanding the connection between players’ estimation of difficulty and the properties of the search trees of variations considered is essential, but not sufficient, for modeling the difficulty of tactical problems. Our findings include that (a) assessing difficulty is also very difficult for human experts, and (b) algorithms designed to estimate difficulty should interpret the complexity of a game tree in the light of knowledge-based patterns that human players are able to detect in a chess problem. Keywords–Task Difficulty; Assessing Problem Difficulty; Eye Tracking; Problem Solving; Chess Tactical Problems; Chess

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Analysis of World Chess Champions

Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires comparison between chess players of different eras who never met across the board. In this paper, we attempt such a comparison based on the evaluation with a chess playing program of games played by the world chess champions in their cha...

متن کامل

Auditory memory function in expert chess players

Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...

متن کامل

Computer Analysis of World Chess Champions1

Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires a comparison between chess players of different eras who never met across the board. In this contribution, we attempt to make such a comparison. It is based on the evaluation of the games played by the World Chess Champions in their cham...

متن کامل

Learning the Piece Values for Three Chess Variants

A set of experiments for learning the values of chess pieces is described for the popular chess variants Crazyhouse Chess, Suicide Chess, and Atomic Chess. We follow an established methodology that relies on reinforcement learning from self-games. We attempt to learn piece values and the piecesquare tables for three chess variants. The piece values arrived at, are quite different from those of ...

متن کامل

Applying Proof-number Search to Chess 0s0z0z0z Z0z0z0ok 0z0z0o0z Z0z0o0z0 0a0o0z0m Z0z0z0z0 Pzpzpo0z Zkz0zbz0

Proof-number search (pn-search) has shown its merit in contributing to the solution of Connect-Four, Qubic and Go-Moku. In this contribution we show that pn-search is a highly capable searcher for mates in chess. Pn-search achieves its results without using any heuristic chess knowledge. We present the results of comparing the performances of pn-search and a number of other mate searchers on a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015